翻訳と辞書 |
Factor oracle : ウィキペディア英語版 | Factor oracle A factor oracle is a finite state automaton that can efficiently search for factors (substrings) in a body of text. Older techniques, such as suffix trees, were time-efficient but required significant amounts of memory. Factor oracles, by contrast, can be constructed in linear time and space in an incremental fashion.〔Allauzen C., Crochemore M., Raffinot M., ''(Factor oracle: a new structure for pattern matching ); Proceedings of SOFSEM’99; Theory and Practice of Informatics.''〕 == Overview ==
Older techniques for matching strings include: suffix arrays, suffix trees, suffix automata or Directed acyclic word graphs, and factor automata (Allauzen, Crochemore, Raffinot, 1999). In 1999, Allauzen, Crochemore, and Raffinot, presented the factor oracle algorithm as a memory efficient improvement upon these older techniques for string matching and compression. Starting in the mid-2000s, factor oracles have found application in computer music, as well.〔Assayag G., Dubnov S., ''Using Factor Oracles for Machine Improvisation.'' Soft Computing - A Fusion of Foundations, Methodologies and Applications. 2004-09-01. Springer Berlin / Heidelberg〕
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Factor oracle」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|